Self-Tuning Spectral Clustering
نویسندگان
چکیده
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular background clutter, and, (iv) Finding automatically the number of groups. We first propose that a ‘local’ scale should be used to compute the affinity between each pair of points. This local scaling leads to better clustering especially when the data includes multiple scales and when the clusters are placed within a cluttered background. We further suggest exploiting the structure of the eigenvectors to infer automatically the number of groups. This leads to a new algorithm in which the final randomly initialized k-means stage is eliminated.
منابع مشابه
An Adaptive Spectral Clustering Algorithm Based on the Importance of Shared Nearest Neighbors
The construction of a similarity matrix is one significant step for the spectral clustering algorithm; while the Gaussian kernel function is one of the most common measures for constructing the similarity matrix. However, with a fixed scaling parameter, the similarity between two data points is not adaptive and appropriate for multi-scale datasets. In this paper, through quantitating the value ...
متن کاملThe Effect of Features on Clustering in Audio Surveillance
The effect of the choice of features on unsupervised clustering in audio surveillance is investigated. The importance of individual features in a larger feature set is first analyzed by examining the component loadings in principal component analysis (PCA). The individual sound events are then assigned into clusters using the self-tuning spectral clustering and the classical K-means algorithms....
متن کاملSpectral Clustering for Time Series
This paper presents a general framework for time series clustering based on spectral decomposition of the affinity matrix. We use the Gaussian function to construct the affinity matrix and develop a gradient based method for self-tuning the variance of the Gaussian function. The feasibility of our method is guaranteed by the theoretical inference in this paper. And our approach can be used to c...
متن کاملOn Determining the Number of Clusters–a Comparative Study
In this paper, we perform one of the first empirical tests comparing several existing algorithms for determining the number of clusters in a data set (the gap statistic, X-means, G-means, data spectroscopic clustering and self-tuning spectral clustering). We use a large number of data sets randomly generated with varying distributions and parameters. The results show that the G-means and X-mean...
متن کاملA Identifying Points of Interest using Heterogeneous Features
Deducing trip related information from web-scale datasets has received large amounts of attention recently. Identifying points of interest (POIs) in geo-tagged photos is one of these problems. The problem can be viewed as a standard clustering problem of partitioning two dimensional objects. In this work, we study spectral clustering which is the first attempt for the POIs identification. Howev...
متن کامل